Generalized #-Rewriting Systems of Finite Index
نویسندگان
چکیده
This paper discusses a generalized version of #-rewriting systems with context rules. It demonstrates that this context-based generalization does not affect the generative power of #-rewriting systems of finite index. A new characterization of the infinite hierarchy of language families generated by programmed grammars of finite index is obtained.
منابع مشابه
Finite Complete Rewriting Systems and Finite Derivation Type for Small Extensions of Monoids
Let S be a monoid and let T be a submonoid of nite index in S. The main results in this paper state that S can be presented by a nite complete rewriting system if T can, and S has nite derivation type if T has.
متن کاملGroups in which every subgroup has finite index in its Frattini closure
In 1970, Menegazzo [Gruppi nei quali ogni sottogruppo e intersezione di sottogruppi massimali, Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. 48 (1970), 559--562.] gave a complete description of the structure of soluble $IM$-groups, i.e., groups in which every subgroup can be obtained as intersection of maximal subgroups. A group $G$ is said to have the $FM$...
متن کاملOn ET0L Systems of Finite Index
The theory of L systems (see, e.g., Herman and Rozenberg (1975) and Rozenberg and Salomaa (1974, 1976)) constitutes today one of the most pursued fragments of formal language theory. Its relevance to the formal language theory stems from the facts that it introduced new range of problems and proof techniques and has put some of the old concepts and problems in a better perspective. In this pape...
متن کاملUPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES
Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...
متن کاملRewriting preserving recognizability of finite tree languages
We show that left-linear generalized semi-monadic TRSs effectively preserving recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRFTRSs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007